翻訳と辞書
Words near each other
・ Wolfdale
・ Wolfdale (microprocessor)
・ Wolfdale, Iowa
・ Wolfdale, Pennsylvania
・ Wolfdietrich
・ Wolfdietrich Schnurre
・ Wolfdog
・ Wolfe
・ Wolfe (provincial electoral district)
・ Wolfe (surname)
・ Wolfe Bowart
・ Wolfe City Formation
・ Wolfe City Group
・ Wolfe City Independent School District
・ Wolfe City, Texas
Wolfe conditions
・ Wolfe County, Kentucky
・ Wolfe Creek Crater
・ Wolfe Creek Meteorite Crater National Park
・ Wolfe duality
・ Wolfe House
・ Wolfe Island
・ Wolfe Island (Ontario)
・ Wolfe Island Wind Farm
・ Wolfe Kelman
・ Wolfe Laboratories
・ Wolfe Lake
・ Wolfe Londoner
・ Wolfe Manor
・ Wolfe Morris


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Wolfe conditions : ウィキペディア英語版
Wolfe conditions
In the unconstrained minimization problem, the Wolfe conditions are a set of inequalities for performing inexact line search, especially in quasi-Newton methods, first published by Philip Wolfe in 1969.
In these methods the idea is to find
::\min_x f(\mathbf)
for some smooth f:\mathbb R^n\to\mathbb R. Each step often involves approximately solving the subproblem
::\min_ f(\mathbf_k + \alpha \mathbf_k)
where \mathbf_k is the current best guess, \mathbf_k \in \mathbb R^n is a search direction, and \alpha \in \mathbb R is the step length.
The inexact line searches provide an efficient way of computing an acceptable step length \alpha that reduces the objective function 'sufficiently', rather than minimizing the objective function over \alpha\in\mathbb R^+ exactly. A line search algorithm can use Wolfe conditions as a requirement for any guessed \alpha, before finding a new search direction \mathbf_k.
==Armijo rule and curvature==
Denote a univariate function \phi restricted to the direction \mathbf_k as \phi(\alpha)=f(\mathbf_k+\alpha\mathbf_k). A step length \alpha_k is said to satisfy the ''Wolfe conditions'' if the following two inequalities hold:
:i) f(\mathbf_k+\alpha_k\mathbf_k)\leq f(\mathbf_k)+c_1\alpha_k\mathbf_k^\nabla f(\mathbf_k),
:ii) \mathbf_k^\nabla f(\mathbf_k+\alpha_k\mathbf_k) \geq c_2\mathbf_k^\nabla f(\mathbf_k),
with 0. (In examining condition (ii), recall that to ensure that \mathbf_k is a descent direction, we have \mathbf_k^\nabla f(\mathbf_k) < 0 .)
c_1 is usually chosen to be quite small while c_2 is much larger; Nocedal gives example values of c_1=10^
and c_2=0.9 for Newton or quasi-Newton methods and c_2=0.1 for the nonlinear conjugate gradient method. Inequality i) is known as the Armijo rule and ii) as the curvature condition; i) ensures that the step length \alpha_k decreases f 'sufficiently', and ii) ensures that the slope has been reduced sufficiently.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Wolfe conditions」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.